Algebraic Bayesian networks: Checking backbone connectivity

نویسندگان

چکیده

The paper investigates the construction of a joint graph as global structure network based on its primary structure, one problems arising in machine learning bases knowledge patterns with uncertainty, presented form algebraic Bayesian networks. aim research is to propose methods for solving inverse problem. As results, algorithms checking belonging family graphs and minimal are proposed, estimates their computational complexity made. An improved version special case an improvement general average also proposed algorithm membership graphs. problem recognition has not been previously researched; issue being addressed first time currently drafted. theoretical significance lies possibilities applying results further researches graph-theoretic invariants structures

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cost-efficient algebraic connectivity optimisation of backbone networks

Backbone networks are prone to failures due to targeted attacks or large-scale disasters. Network resilience can be improved by adding new links to increase network connectivity and robustness. However, random link additions without an optimisation objective function can have insignificant connectivity improvement. In this paper, we develop a heuristic algorithm that optimises a network by addi...

متن کامل

Algebraic geometry of Bayesian networks

We study the algebraic varieties defined by the conditional independence statements of Bayesian networks. A complete algebraic classification is given for Bayesian networks on at most five random variables. Hidden variables are related to the geometry of higher secant varieties.

متن کامل

Maximizing algebraic connectivity in interconnected networks.

Algebraic connectivity, the second eigenvalue of the Laplacian matrix, is a measure of node and link connectivity on networks. When studying interconnected networks it is useful to consider a multiplex model, where the component networks operate together with interlayer links among them. In order to have a well-connected multilayer structure, it is necessary to optimally design these interlayer...

متن کامل

An Algebraic Characterization of Equivalent Bayesian Networks

In this paper, we propose an algebraic characterization for equivalent classes of Bayesian networks. Unlike the other characterizations, which are based on the graphical structure of Bayesian networks, our algebraic characterization is derived from the intrinsic algebraic structure of Bayesian networks, i.e., joint probability distribution factorization. The new proposed algebraic characterizat...

متن کامل

Algebraic Geometry of Gaussian Bayesian Networks

Conditional independence models in the Gaussian case are algebraic varieties in the cone of positive definite covariance matrices. We study these varieties in the case of Bayesian networks, with a view towards generalizing the recursive factorization theorem to situations with hidden variables. In the case when the underlying graph is a tree, we show that the vanishing ideal of the model is gen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ??????? ?????-?????????????? ????????????

سال: 2021

ISSN: ['1811-9905', '2542-2251']

DOI: https://doi.org/10.21638/spbu01.2021.210